task graph

См. также в других словарях:

• Task allocation and partitioning of social insects — Task allocation and partitioning refers to the way that tasks are chosen, assigned, subdivided, and coordinated (here, within a single colony of social insects). Closely associated are issues of communication that enable these actions to… …   Wikipedia

• GRaPH-Int — The Genome based Research and Population Health International Network (GRaPH Int) is an international collaboration of experts and researchers focused in the area of population health. The principal goal of the network is to promote the… …   Wikipedia

• Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

• Graph partition — The graph partitioning problem in mathematics consists of dividing a graph into pieces, such that the pieces are of about the same size and there are few connections between the pieces.Consider a graph G(V,E), where V denotes the set of vertices… …   Wikipedia

• S-graph — An S graph is a graphical and theoretical approach to efficiently solving batch process scheduling problems in chemical plants. [Cite journal |last=Holczinger |first=T. |coauthors=J Romero, L Puigjaner, F Friedler |title=Scheduling of… …   Wikipedia

• Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i …   Wikipedia

• Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… …   Wikipedia

• Intersection number (graph theory) — In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover… …   Wikipedia

• Node graph architecture — is a type of software design which builds around modular node components which can be connected together to form a graph. Often the software s underlying node graph architecture is also exposed to the end user as a 2 dimensional visualization of… …   Wikipedia

• Constraint graph (layout) — In some tasks of integrated circuit layout design a necessity arises to optimize placement of non overlapping objects in the plane. In general this problem is extremely hard, and to tackle it with computer algorithms, certain assumptions are made …   Wikipedia

• Living graph — In terms of knowledge representation, a Living Graph is similar to a chronology timeline. However, rather than simply listing events along a horizontal axis to reflect changes over a time, a living graph also places events high or low on vertical …   Wikipedia